PATCH Graphs: An Efficient Data Structure for Completion of Finitely Presented Groups
نویسندگان
چکیده
Based on a new data structure called PATCH Graph, an eecient completion procedure for nitely presented groups is described. A PATCH Graph represents rules and their symmetrized forms as cycles in a Cayley graph structure. Completion is easily performed directly on the graph, and structure sharing is enforced. The structure of the graph allows us to avoid certain redundant inferences. The PATCH Graph data structure and inference rules complement other extensions of Knuth-Bendix completion for nitely presented groups.
منابع مشابه
Patch Graphs: an Eecient Data Structure for Completion of Finitely Presented Groups
Based on a new data structure called PATCH Graph, an eecient completion procedure for nitely presented groups is described. A PATCH Graph represents rules and their symmetrized forms as cycles in a Cayley graph structure. Completion is easily performed directly on the graph, and structure sharing is enforced. The structure of the graph allows us to avoid certain redundant inferences. The PATCH ...
متن کاملAn Efficient Strategy for Word-Cycle Completion in Finitely Presented Groups
We present an efficient strategy for the application of the inference rules of a completion procedure for finitely presented groups. This procedure has been proposed by Cremanns and Otto and uses a combinatorial structure called word-cycle. Our strategy is complete in the sense that a set of persistent word-cycles can be used to solve the reduced word problem of the finitely presented group giv...
متن کاملOn trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملImproving Exemplar-based Image Completion methods using Selecting the Optimal Patch
Image completion is one of the subjects in image and video processing which deals with restoration of and filling in damaged regions of images using correct regions. Exemplar-based image completion methods give more pleasant results than pixel-based approaches. In this paper, a new algorithm is proposed to find the most suitable patch in order to fill in the damaged parts. This patch selection ...
متن کاملDetermination of Resonance Frequency of Dominant and Higher Order Modes in Thin and Thick Circular Microstrip Patch Antennas with Superstrate by MWM (RESEARCH NOTE)
An accurate model named as the Modified Wolff Model (MWM) is presented as an efficient CAD tool for determination of resonant frequency of the dominant and higher order modes under the multi-layer condition in thin and thick circular microstrip patch antennas. The effects of dielectric cover on the resonant frequency obtained from MWM have been compared against the result of theoretical method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996